Investigating Perceptions of a Location%2DBased Annotation System.

Mining Interaction Behaviors for Email Reply Order Prediction.

Mining Interaction Behaviors for Email Reply Order Prediction.

Finding unusual review patterns using unexpected rules.

Mining interesting link formation rules in social networks.

Detecting product review spammers using rating behaviors.

Visualizing and Exploring Evolving Information Networks in Wikipedia.



Managing Media Rich Geo%2Dspatial Annotations for a Map%2DBased Mobile Application Using Clustering.

Do Wikipedians follow domain experts%3F a domain%2Dspecific study on Wikipedia knowledge building.

Trust network inference for online rating data using generative models.

Mining Antagonistic Communities from Social Networks.

Do You Trust to Get Trust%3F A Study of Trust Reciprocity Behaviors and Reciprocal Trust Prediction.

A Probabilistic Approach to Personalized Tag Recommendation.

Messaging Behavior Modeling in Mobile Social Networks.

Mining Collaboration Patterns from a Large Developer Network.

TwitterRank finding topic%2Dsensitive influential twitterers.

STEvent Spatio%2Dtemporal event model for social network discovery.

Keep It Simple with Time A Reexamination of Probabilistic Topic Detection Models.

Trust%2DOriented Composite Service Selection with QoS Constraints.

Sharing Mobile Multimedia Annotations to Support Inquiry%2DBased Learning Using MobiTOP.

What makes categories difficult to classify%3F a study on predicting classification performance for categories.

StereoTrust a group based personalized trust model.

Trust relationship prediction using online product review data.
Trust between users is an important piece of knowledge that can be exploited in search and recommendation. Given that user-supplied trust relationships are usually very sparse, we study the prediction of trust relationships using user interaction features in an online user generated review application context. We show that trust relationship prediction can achieve better accuracy when one adopts personalized and cluster-based classification methods. The former trains one classifier for each user using user-specific training data. The cluster-based method first constructs user clusters before training one classifier for each user cluster. Our proposed methods have been evaluated in a series of experiments using two datasets from Epinions.com. It is shown that the personalized and cluster-based classification methods outperform the global classification method, particularly for the active users.
Web Query Recommendation via Sequential Query Prediction.
Abstract — Web query recommendation has long been considered a key feature of search engines. Building a good Web query recommendation system, however, is very difficult due to the fundamental challenge of predicting users ’ search intent, especially given the limited user context information. In this paper, we propose a novel “sequential query prediction ” approach that tries to grasp a user’s search intent based on his/her past query sequence and its resemblance to historical query sequence models mined from massive search engine logs. Different query sequence models were examined, including the naive variablelength N-gram model, Variable Memory Markov (VMM) model, and our proposed Mixture Variable Memory Markov (MVMM) model. Extensive experiments were conducted to benchmark our sequence prediction algorithms against two conventional pairwise approaches on large-scale search logs extracted from a commercial search engine. Results show that the sequence-wise approaches significantly outperform the conventional pair-wise ones in terms of prediction accuracy. In particular, our MVMM approach, consistently leads the pack, making it an effective and practical approach towards Web query recommendation.
Web Query Recommendation via Sequential Query Prediction.
Abstract — Web query recommendation has long been considered a key feature of search engines. Building a good Web query recommendation system, however, is very difficult due to the fundamental challenge of predicting users ’ search intent, especially given the limited user context information. In this paper, we propose a novel “sequential query prediction ” approach that tries to grasp a user’s search intent based on his/her past query sequence and its resemblance to historical query sequence models mined from massive search engine logs. Different query sequence models were examined, including the naive variablelength N-gram model, Variable Memory Markov (VMM) model, and our proposed Mixture Variable Memory Markov (MVMM) model. Extensive experiments were conducted to benchmark our sequence prediction algorithms against two conventional pairwise approaches on large-scale search logs extracted from a commercial search engine. Results show that the sequence-wise approaches significantly outperform the conventional pair-wise ones in terms of prediction accuracy. In particular, our MVMM approach, consistently leads the pack, making it an effective and practical approach towards Web query recommendation.
To Trust or Not to Trust%3F Predicting Online Trusts Using Trust Antecedent Framework.

Trust%2DOriented Composite Service Selection and Discovery.

Predicting Outcome for Collaborative Featured Article Nomination in Wikipedia.

Exploring Hierarchically Organized Georeferenced Multimedia Annotations in the MobiTOP System.

On Mining Rating Dependencies in Online Collaborative Rating Networks.
Abstract. The trend of social information processing sees e-commerce and social web applications increasingly relying on user-generated content, such as rating, to determine the quality of objects and to generate recommendations for users. In a rating system, a set of reviewers assign to a set of objects different types of scores based on specific evaluation criteria. In this paper, we seek to determine, for each reviewer and for each object, the dependency between scores on any two given criteria. A reviewer is said to have high dependency between a pair of criteria when his or her rating scores on objects based on the two criteria exhibit strong correlation. On the other hand, an object is said to have high dependency between a pair of criteria when the rating scores it receives on the two criteria exhibit strong correlation. Knowing reviewer dependency and object dependency is useful in various applications including recommendation, customization, and score moderation. We propose a model, called Interrelated Dependency, which determines both types of dependency simultaneously, taking into account the interrelatedness between the two types of dependency. We verify the efficacy of this model through experiments on real-life data. 1
Quality%2Daware collaborative question answering methods and evaluation.

On strategies for imbalanced text classification using SVM A comparative study.

Localized monitoring of kNN queries in wireless sensor networks.

Proceedings of the 2nd ACM Workshop on Information Credibility on the Web

Predicting trusts among users of online communities an epinions case study.

Price Trust Evaluation in E%2Dservice Oriented Applications.

TagNSearch Searching and Navigating Geo%2Dreferenced Collections of Photographs.

On Visualizing Heterogeneous Semantic Networks from Multiple Data Sources.

MobiTOP Accessing Hierarchically Organized Georeferenced Multimedia Annotations.

Building a web of trust without explicit trust ratings.

WikiNetViz Visualizing friends and adversaries in implicit social networks.

Visual Analytics for Supporting Entity Relationship Discovery on Text Data.

Comments%2Doriented document summarization understanding documents with readers%27 feedback.

Searching blogs and news a study on popular queries.

Event detection with common user interests.

On ranking controversies in wikipedia models and evaluation.
Wikipedia 1 is a very large and successful Web 2.0 example. As the number of Wikipedia articles and contributors grows at a very fast pace, there are also increasing disputes occurring among the contributors. Disputes often happen in articles with controversial content. They also occur frequently among contributors who are “aggressive ” or controversial in their personalities. In this paper, we aim to identify controversial articles in Wikipedia. We propose three models, namely the Basic model and two Controversy Rank (CR) models. These models draw clues from collaboration and edit history instead of interpreting the actual articles or edited content. While the Basic model only considers the amount of disputes within an article, the two Controversy Rank models extend the former by considering the relationships between articles and contributors. We also derived enhanced versions of these models by considering the age of articles. Our experiments on a collection of 19,456 Wikipedia articles shows that the Controversy Rank models can more effectively determine controversial articles compared to the Basic and other baseline models.
Modeling Anticipatory Event Transitions.

Analytical Customer Relationship Management.
Customer relationship management (CRM) typically involves tracking individual customer behavior over time, and using this knowledge to configure solutions precisely tailored to the customers ’ and vendors ’ needs. In the context of choice, this implies designing longitudinal models of choice over the breadth of the firm’s products and using them prescriptively to increase the revenues from customers over their lifecycle. Several factors have recently contributed to the rise in the use of CRM in the marketplace: • A shift in focus in many organizations, towards increasing the share of requirements among their current customers rather than fighting for new customers. • An explosion in data acquired about customers, through the integration of internal databases and acquisition of external syndicated data. • Computing power is increasing exponentially. • Software and tools are being developed to exploit these data and computers, bringing the analytical tools to the decision maker, rather than restricting their access to analysts. In spite of this growth in marketing practice, CRM research in academia remains nascent. This paper provides a framework for CRM research and describes recent advances as well as key research opportunities. See
Dynamic Web Service Selection for Reliable Web Service Composition.

Bias and Controversy in Evaluation Systems.

Scholarly digital libraries at scale introduction to the special issue on very large digital libraries.

Efficient algorithms for mining maximal valid groups.

Measuring article quality in wikipedia models and evaluation.
Wikipedia has grown to be the world largest and busiest free encyclopedia, in which articles are collaboratively written and maintained by volunteers online. Despite its success as a means of knowledge sharing and collaboration, the public has never stopped criticizing the quality of Wikipedia articles edited by non-experts and inexperienced contributors. In this paper, we investigate the problem of assessing the quality of articles in collaborative authoring of Wikipedia. We propose three article quality measurement models that make use of the interaction data between articles and their contributors derived from the article edit history. Our Basic model is designed based on the mutual dependency between article quality and their author authority. The PeerReview model introduces the review behavior into measuring article quality. Finally, our ProbReview models extend PeerReview with partial reviewership of contributors as they edit various portions of the articles. We conduct experiments on a set of well-labeled Wikipedia articles to evaluate the effectiveness of our quality measurement models in resembling human judgement.

Comments%2Doriented blog summarization by sentence extraction.


Key Element%2DContext Model An Approach to Efficient Web Metadata Maintenance.
Abstract. In this paper, we study the problem of maintaining metadata for open Web content. In digital libraries such as DLESE, NSDL and G-Portal, metadata records are created for some good quality Web content objects so as to make them more accessible. These Web objects are dynamic making it necessary to update their metadata records. As Web metadata maintenance involves manual efforts, we propose to reduce the efforts by introducing the Key element-Context (KeC)modeltomonitor only those changes made on Web page content regions that concern metadata attributes while ignoring other changes. We also develop evaluation metrics to measure the number of alerts and the amount of efforts in updating Web metadata records. KeC model has been experimented on metadata records defined for Wikipedia articles, and its performance with different settings is reported. The model is implemented in G-Portal as a metadata maintenance module. 1
Mobile Tagging and Accessibility Information Sharing Using a Geospatial Digital Library.

Social Navigation in Digital Libraries by Bookmarking.

Using Burstiness to Improve Clustering of Topics in News Streams.

On Composing a Reliable Composite Web Service A Study of Dynamic Web Service Selection.

Mobile G%2DPortal supporting collaborative sharing and learning in geography fieldwork an empirical study.
Integrated with G-Portal, a Web-based geospatial digital library of geography resources, this paper describes the implementation of Mobile G-Portal, a group of mobile devices as learning assistant tools supporting collaborative sharing and learning for geography fieldwork. Based on a modified Technology Acceptance Model and a Task-Technology Fit model, an initial study with Mobile G-Portal was conducted involving 39 students in a local secondary school. The findings suggested positive indication of acceptance of Mobile G-Portal for geography fieldwork. The paper concludes with a discussion on technological challenges, recommendations for refinement of Mobile G-Portal, and design implications in general for digital libraries and personal digital assistants supporting mobile learning.
Social bookmarking in digital library systems framework and case study.

Mobile digital libraries for geography education.

Anticipatory Event Detection for Bursty Events.

Modeling Anticipatory Event Transitions.

TUBE %28Text%2DcUBE%29 for discovering documentary evidence of associations among entities.

Bursty Feature Representation for Clustering Text Streams.
Text representation plays a crucial role in classical text mining, where the primary focus was on static text. Nevertheless, well-studied static text representations including TFIDF are not optimized for non-stationary streams of information such as news, discussion board messages, and blogs. We therefore introduce a new temporal representation for text streams based on bursty features. Our bursty text representation differs significantly from traditional schemes in that it 1) dynamically represents documents over time, 2) amplifies a feature in proportional to its burstiness at any point in time, and 3) is topic independent. Our bursty text representation model was evaluated against a classical bagof-words text representation on the task of clustering TDT3 topical text streams. It was shown to consistently yield more cohesive clusters in terms of cluster purity and cluster/class entropies. This new temporal bursty text representation can be extended to most text mining tasks involving a temporal dimension, such as modeling of online blog pages. 1
Analyzing feature trajectories for event detection.

Summarizing Review Scores of %22Unequal%22 Reviewers.
Although Bayesian analysis has been in use since Laplace, the Bayesian method of model--comparison has only recently been developed in depth.  In this paper, the Bayesian approach to regularisation and model--comparison is demonstrated by studying the inference problem of interpolating noisy data. The concepts and methods described are quite general and can be applied to many other problems.  Regularising constants are set by examining their posterior probability distribution. Alternative regularisers (priors) and alternative basis sets are objectively compared by evaluating the evidence for them. `Occam&#039;s razor&#039; is automatically embodied by this framework.  The way in which Bayes infers the values of regularising constants and noise levels has an elegant interpretation in terms of the effective number of parameters determined by the data set. This framework is due to Gull and Skilling.  1 Data modelling and Occam&#039;s razor In science, a central task is to develop and compare models to a...
Analyzing feature trajectories for event detection.

On improving wikipedia search using article quality.

Anticipatory event detection via classification.

In%2DNetwork Join Processing for Sensor Networks.

In%2DNetwork Processing of Nearest Neighbor Queries for Wireless Sensor Networks.
Abstract. Wireless sensor networks have been widely used for civilian and military applications, such as environmental monitoring and vehicle tracking. The sensor nodes in the network have the abilities to sense, store, compute and communicate. To enable object tracking applications, spatial queries such as nearest neighbor queries are to be supported in these networks. The queries can be injected by the user at any sensor node. Due to the limited power supply for sensor nodes, energy efficiency is the major concern in query processing. Centralized data storage and query processing schemes do not favor energy efficiency. In this paper, we propose a distributed scheme called DNN for in-network processing of nearest neighbor queries. A cost model is built to analyze the performance of DNN. Experimental results show that DNN outperforms the centralized scheme significantly in terms of energy consumption and network lifetime. 1
A Model for Anticipatory Event Detection.

Integration of Wikipedia and a Geography Digital Library.

Understanding User Perceptions on Usefulness and Usability of an Integrated Wiki%2DG%2DPortal.

Bias and controversy beyond the statistical deviation.
In this paper, we investigate how deviation in evaluation activities may reveal bias on the part of reviewers and controversy on the part of evaluated objects. We focus on a ‘datacentric approach ’ where the evaluation data is assumed to represent the ‘ground truth’. The standard statistical approaches take evaluation and deviation at face value. We argue that attention should be paid to the subjectivity of evaluation, judging the evaluation score not just on ‘what is being said ’ (deviation), but also on ‘who says it ’ (reviewer) as well as on ‘whom it is said about ’ (object). Furthermore, we observe that bias and controversy are mutually dependent, as there is more bias if there is higher deviation on a less controversial object. To address this mutual dependency, we propose a reinforcement model to identify bias and controversy. We test our model on real-life data to verify its applicability.
On In%2Dnetwork Synopsis Join Processing for Sensor Networks.

Continuous Monitoring of kNN Queries in Wireless Sensor Networks.

FISA Feature%2DBased Instance Selection for Imbalanced Text Classification.

SGPM Static Group Pattern Mining Using Apriori%2DLike Sliding Window.

INEXT An Investigative Search Tool for Knowledge Extraction.

Measuring Qualities of Articles Contributed by Online Communities.
Using open source Web editing software (e.g., wiki), online community users can now easily edit, review and publish articles collaboratively. While much useful knowledge can be derived from these articles, content users and critics are often concerned about their qualities. In this paper, we develop two models, namely basic model and peer review model, for measuring the qualities of these articles and the authorities of their contributors. We represent collaboratively edited articles and their contributors in a bipartite graph. While the basic model measures an article’s quality using both the authorities of contributors and the amount of contribution from each contributor, the peer review model extends the former by considering the review aspect of article content. We present results of experiments conducted on some Wikipedia pages and their contributors. Our result show that the two models can effectively determine the articles’ qualities and contributors ’ authorities using the collaborative nature of online communities.
Efficient mining of group patterns from user movement data.

An Energy%2DEfficient and Access Latency Optimized Indexing Scheme for Wireless Data Broadcast.

Extracting link chains of relationship instances from a Web site.

Web unit%2Dbased mining of homepage relationships.

Core A Search and Browsing Tool for Semantic Instances of Web Sites.

Managing Geography Learning Objects Using Personalized Project Spaces in G%2DPortal.

WebArc Website Archival Using a Structured Approach.

On Discovering Concept Entities from Web Sites.

Event%2DDriven Document Selection for Terrorism Information Extraction.

Evaluating G%2Dportal for geography learning and teaching.

On assigning place names to geography related web pages.

Personalized project space for managing metadata of geography learning objects.

Mining Mobile Group Patterns A Trajectory%2DBased Approach.

Social Network Discovery by Mining Spatio%2DTemporal Events.

GeogDL a web%2Dbased approach to geography examination revision.

DEQUE querying the deep web.

Linear correlation discovery in databases a data mining approach.

Fifth ACM International Workshop on Web Information and Data Management %28WIDM 2003%29.

Agents and Stream Data Mining A New Perspective.
has always been an ongoing issue for many organizations. While data mining has been touted to be the solution, it has failed to deliver the impact despite its successes in many areas. One reason is that data mining algorithms were not designed for the real world, i.e., they usually assume a static view of the data and a stable execution environment where resources are abundant. The reality however is that data are constantly changing and the execution environment is dynamic. Hence, it becomes di#cult for data mining to truly deliver timely and relevant results. Recently, the processing of stream data has received many attention. What is interesting is that the methodology to design stream-based algorithms, which when combined with agents, may well be the solution to the above problem. In this article, we discuss this issue and present some preliminary results of our work in the Matrix project.
Finding and classifying web units in websites.

Finding and classifying web units in websites.

Discovery of Concept Entities from Web Sites using Web Unit Mining.

Applying scenario%2Dbased design and claims analysis to the design of a digital library of geography examination resources.

On organizing and accessing geospatial and georeferenced Web resources using the G%2DPortal system.
In order to organise and manage geospatial and georeferenced information on the web making them convenient for searching and browsing, a digital portal known as G-Portal has been designed and implemented. Compared to other digital libraries, G-Portal is unique for several of its features. It maintains metadata resources in XML with flexible resource schemas. Logical groupings of metadata resources as projects and layers are possible to allow the entire metadata collection to be partitioned di#erently for users with di#erent information needs. These metadata resources can be displayed in both the classification-based and map-based interfaces provided by G-Portal. G-Portal further incorporates both a query module and an annotation module for users to search metadata and to create additional knowledge for sharing respectively. G-Portal also includes a resource classification module that categorizes resources into one or more hierarchical category trees based on userdefined classification schemas. This paper gives an overview of the G-Portal design and implementation. The portal features will be illustrated using a collection of high school geography examination-related resources.
Scheduling Queries to Improve the Freshness of a Website.
The WWW is a new advertising media in recent years where corporations utilize it to  increase their exposure to consumers. For a very large website whose content is derived  from some source database, it is important to maintain its freshness in response to  changes to the base data. This issue is particularly signicant for websites presenting  fast changing information such as stock exchange information and product information.  In this paper, we formally dene and study the freshness of a website that is refreshed  by scheduling a set of queries to fetch fresh data from the databases. Then, we propose  several online scheduling algorithms and compare the performance of the algorithms on  the freshness metric. Our conclusion is veried by empirical results.  Keywords: Internet Data Management, View Maintenance, Query Optimization, Hard  Real-Time Scheduling  1 Introduction  The popularity of the World-Wide Web (WWW) has made it a prime vehicle for disseminating information. More and ...
ACM%2FIEEE Joint Conference on Digital Libraries

Digital Libraries International Collaboration and Cross%2DFertilization

Unloading Unwanted Information From Physical Websites to Personalized Web Views.
With the explosion of information on the Web, information that is made available from websites is generally overwhelming for users surfing the sites. The majority of the users who are facing this information overloading problem are the ordinary home users who do not have much technical knowledge. It is thus important to allow these users to easily create personalized views of websites such that they only see what they want in the way they prefer.
An Automated Algorithm for Extracting Website Skeleton.
The huge amount of information available on the Web has attracted  many research e#orts into developing wrappers that extract data  from webpages. However, as most of the systems for generating wrappers  focus on extracting data at page-level, data extraction at site-level  remains a manual or semi-automatic process. In this paper, we study the  problem of extracting website skeleton, i.e. extracting the underlying hyperlink  structure that is used to organize the content pages in a given  website. We propose an automated algorithm, called the Sew algorithm,  to discover the skeleton of a website. Given a page, the algorithm examines  hyperlinks in groups and identifies the navigation links that point  to pages in the next level in the website structure. The entire skeleton is  then constructed by recursively fetching pages pointed by the discovered  links and analyzing these pages using the same process. Our experiments  on real life websites show that the algorithm achieves a high recall with  moderate precision.
Efficient Group Pattern Mining Using Data Summarization.

SCLOPE An Algorithm for Clustering Data Streams of Categorical Attributes.
Clustering is a di#cult problem especially when we consider  the task in the context of a data stream of categorical attributes. In this  paper, we propose SCLOPE, a novel algorithm based on CLOPE&#039;s intuitive  observation about cluster histograms. Unlike CLOPE however, our algorithm  is very fast and operates within the constraints of a data stream  environment. In particular, we designed SCLOPE according to the recent  CluStream framework. Our evaluation of SCLOPE shows very promising  results. It consistently outperforms CLOPE in speed and scalability tests  on our data sets while maintaining high cluster purity; it also supports  cluster analysis that other algorithms in its class do not.
Supporting Field Study with Personalized Project Spaces in a Geographical Digital Library.

Design Lessons on Access Features in PAPER.

Spectral Analysis of Text Collection for Similarity%2Dbased Clustering.

Spectral Analysis of Text Collection for Similarity%2DBased Clustering.

A Spectroscopy of Texts for Effective Clustering.
For many clustering algorithms, such as k-means, EM, and  CLOPE, there is usually a requirement to set some parameters. Often,  these parameters directly or indirectly control the number of clusters to  return. In the presence of di#erent data characteristics and analysis contexts,  it is often di#cult for the user to estimate the number of clusters  in the data set. This is especially true in text collections such as Web  documents, images or biological data. The fundamental question this paper  addresses is: &#034;How can we e#ectively estimate the natural number of  clusters in a given text collection?&#034;. We propose to use spectral analysis,  which analyzes the eigenvalues (not eigenvectors) of the collection, as the  solution to the above. We first present the relationship between a text  collection and its underlying spectra. We then show how the answer to  this question enhances the clustering process. Finally, we conclude with  empirical results and related work.
LTAM A Location%2DTemporal Authorization Model.
Abstract. With the growing advancement of pervasive computing technologies, we are moving towards an era where spatio-temporal information will be necessary for access control. The use of such information can be used for enhancing the security of an application, and it can also be exploited to launch attacks. For critical applications, a formal model for spatio-temporal-based access control is needed that increases the security of the application and ensures that the location information cannot be exploited to cause harm. In this paper, we propose a spatio-temporal access control model, based on the Role-Based Access Control (RBAC) model, that is suitable for pervasive computing applications. We show the association of each component of RBAC with spatio-temporal information. We formalize the model by enumerating the constraints. This model can be used for applications where spatial and temporal information of a subject and an object must be taken into account before granting or denying access. 1
Fourth ACM International Workshop on Web Information and Data Management %28WIDM 2002%29.

Towards building logical views of websites.

Accommodating instance heterogeneities in database integration.

Personalized Web Views for Multilingual Web Sources.

Blocking Reduction Strategies in Hierarchical Text Classification.

A Support%2DOrdered Trie for Fast Frequent Itemset Discovery.

Introduction to the Journal on Digital Libraries special issue on Asian digital libraries.

Parameter driven synthetic web database generation.

Report on the fifth ACM international workshop on Web information and data management %28WIDM 2003%29.

A Java%2Dbased digital library portal for geography education.

Fifth ACM CIKM International Workshop on Web Information and Data Management %28WIDM 2003%29

CrystalBall  A Framework for Mining Variants of Association Rules.

ENAXS Efficient Native XML Storage System.

Web unit mining finding and classifying subgraphs of web pages.

An Architectural Framework for Native XML Data Management.

On Mining Group Patterns of Mobile Users.
Abstract. In this paper, we present a group pattern mining approach to derive the grouping information of mobile device users based on the spatio-temporal distances among them. Group patterns of users are determined by a distance threshold and a minimum duration. To discover group patterns, we propose the AGP and VG-growth algorithms that are derived from the Apriori and FP-growth algorithms respectively. We further evaluate the efficiencies of these two algorithms using synthetically generated user movement data. 1
A Visual Interface for Native XML Database.

FSSM Fast Construction of the Optimized Segment Support Map.
Computing the frequency of a pattern is one of the key operations  in data mining algorithms. Recently, the Optimized Segment  Support Map (OSSM) was introduced as a simple but powerful way of  speeding up any form of frequency counting satisfying the monotonicity  condition. However, the construction cost to obtain the ideal OSSM  is high, and makes it less attractive in practice. In this paper, we propose  the FSSM, a novel algorithm that constructs the OSSM quickly  using a FP-Tree. Given a user-defined segment size, the FSSM is able  to construct the OSSM at a fraction of the time required by the algorithm  previously proposed. More importantly, this fast construction  time is achieved without compromising the quality of the OSSM. Our  experimental results confirm that the FSSM is a promising solution for  constructing the best OSSM within user given constraints.
Towards a Role%2DBased Metadata Scheme for Educational Digital Libraries A Case Study in Singapore.
Towards a role-based metadata scheme for educational digital libraries:
PAPER for an Educational Digital Library.

On Extracting Link Information of Relationship Instances from a Web Site.

Using Support Vector Machines for Terrorism Information Extraction.

On Querying Geospatial and Georeferenced Metadata Resources in G%2DPortal.
G-Portal is a web portal system providing a range of digital library services to access geospatial and georeferenced resources on the Web. Among them are the storage and query subsystems that provide a central repository of metadata resources organized under different projects. In GPortal, all metadata resources are represented in XML (Extensible Markup Language) and they are compliant to some resource schemas defined by their creators. The resource schemas are extended versions of a basic resource schema making it easy to accommodate all kinds of metadata resources while maintaining the portability of resource data. To support queries over the geospatial and georeferenced metadata resources, a XQuery-like query language known as (Resource Query Language) has been designed. In this paper, we present the language features and provide some experimental findings about the storage design and query evaluation strategies for queries.
Data model for warehousing historical Web information.

Performance measurement framework for hierarchical text classification.
Hierarchical text classification or simply hierarchical classification refers to assigning a document to one or more suitable categories from a hierarchical category space. In our literature survey, we have found that the existing hierarchical classification experiments used a variety of measures to evaluate performance. These performance measures often assume independence between categories and do not consider documents misclassified into categories that are similar or not far from the correct categories in the category tree. In this paper, we therefore propose new performance measures for hierarchical classification. The proposed performance measures consist of category similarity measures and distance-based measures that consider the contributions of misclassified documents. Our experiments on hierarchical classification methods based on SVM classifiers and binary Naïve Bayes classifiers showed that SVM classifiers perform better than Naïve Bayes classifiers on Reuters-21578 collection according to the extended measures. A new classifier-centric measure called blocking measure is also defined to examine the performance of subtree classifiers in a top-down levelbased hierarchical classification method.
Instance%2Dbased attribute identification in database integration.

Fourth ACM CIKM International Workshop on Web Information and Data Management %28WIDM 2002%29

Digital Libraries People
The aim of the work reported here was to better understand the  usability issues raised when digital libraries are used in a  natural setting. The method used was a protocol analysis of  users working on a task of their own choosing to retrieve  documents from publicly available digital libraries. Various  classes of usability difficulties were found. Here, we focus on  use in context --- that is, usability concerns that arise from the  fact that libraries are accessed in particular ways, under  technically and organisationally imposed constraints, and that use of any particular resource is discretionary. The concepts  from an Interaction Framework, which provides support for  reasoning about patterns of interaction between users and  systems, are applied to understand interaction issues.  Keywords  Digital Libraries, video protocols, interaction modelling, HCI.  1. 
Personalized Classification for Keyword%2DBased Category Profiles.
Personalized classification refers to allowing users to define  their own categories and automating the assignment of documents to  these categories. In this paper, we examine the use of keywords to define  personalized categories and propose the use of Support Vector Machine  (SVM) to perform personalized classification. Two scenarios have been  investigated. The first assumes that the personalized categories are defined  in a flat category space. The second assumes that each personalized  category is defined within a pre-defined general category that provides a  more specific context for the personalized category. The training documents  for personalized categories are obtained from a training document  pool using a search engine and a set of keywords. Our experiments have  delivered better classification results using the second scenario. We also  conclude that the number of keywords used can be very small and increasing  them does not always lead to better classification performance.
A Data Mining Approach to New Library Book Recommendations.

Resource Annotation Framework in a Georeferenced and Geospatial Digital Library.
G-Portal is a georeferenced and geospatial digital library that aims to identify, classify and organize geospatial and georeferenced resources on the web and to provide digital library services for these resources. Annotation service is supported in G-Portal to enable users to contribute content to the digital library. In this paper, we present a resource annotation framework for georeferenced and geospatial digital libraries and discuss its application in G-Portal. The framework is flexible for managing annotations of heterogeneous web resources. It allows users to contribute not only the annotation content but also the schema of the annotations. Meanwhile, other digital library services, such as visualization and classification, can be provided over the annotations since they are treated as first class objects. This paper mainly focuses on the design of the resource annotation framework.
Intergenerational Partnerships in the Design of a Digital Library of Geography Examination Resources.

A digital library for geography examination resources.
We describe a Web-based application developed above a digital library of geographical resources for Singapore students preparing to take a national examination in geography. The application provides an interactive, non-sequential approach to learning that supplements textbooks.
G%2DPortal a map%2Dbased digital library for distributed geospatial and georeferenced resources.
As the World Wide Web evolves into an immense information network, it is tempting to build new digital library services and expand existing digital library services to make use of web content. In this paper, we present the design and implementation of G-Portal, a web portal that aims to provide digital library services over geospatial and georeferenced content found on the World Wide Web. G-Portal adopts a map-based user interface to visualize and manipulate the distributed geospatial and georeferenced content. Annotation capabilities are supported, allowing users to contribute geospatial and georeferenced objects as well as their associated metadata. The other features included in GPortal &#039;s design are query support, content classification, and content maintenance. This paper will mainly focus on the architecture design, visualization and annotation capabilities of G-Portal.
A Case for Analytical Customer Relationship Management.

Mining Relationship Graphs for Effective Business Objectives.
Modern organization has two types of customer profiles: active and passive. Active customers contribute to the business goals of an organization, while passive customers are potential candidates that can be converted to active ones. Existing KDD techniques focused mainly on past data generated by active customers. The insights discovered apply well to active ones but may scale poorly with passive customers. This is because there is no attempt to generate know-how to convert passive customers into active ones. We propose an algorithm to discover relationship graphs using both types of profile. Using relationship graphs, an organization can be more effective in realizing its goals.
Efficient k Nearest Neighbor Queries on Remote Spatial Databases Using Range Estimation.
K-Nearest Neighbor (k-NN) queries are used in GIS and CAD/CAM applications to find the k spatial objects closest to some given query points. Most previous k-NN research has assumed that the spatial databases to be queried are local, and that the query processing algorithms have direct access to their spatial indices; e.g., R-trees. Clearly, this assumption does not hold when k-NN queries are directed at remote spatial databases that operate autonomously. While it is possible to replicate some or all the spatial objects from the remote databases in a local database and build a separate index structure for them, such an alternative is infeasible when the database is huge, or there are large number of spatial databases to be queried. In this paper, we propose a k-NN query processing algorithm that uses one or more window queries to retrieve the nearest neighbors of a given query point. We also propose two di#erent methods to estimate the ranges to be used by the window queries. Each range estimation method requires di#erent statistical knowledge about the spatial databases. Our experiments on the TIGER data allow us to study the behavior of the proposed algorithm using di#erent range estimation methods. Apart from not requiring direct access to the spatial indices, the window queries used in the proposed algorithm can be easily supported by non-spatial database systems containing spatial objects.
A visual tool for building logical data models of websites.
Information sources over the WWW contain a large amount of data organized according to different interests and values. Thus, it is important that facilities are there to enable users to extract information of interest in a simple and effective manner. To do this, We propose the Wiccap Data Model, an XML data model that maps Web information sources into commonly perceived logical models, so that information can be extracted automatically according to users&#039; interests. To accelerate the creation of data models, we have implemented a visual tool, called the Mapping Wizard, to facilitate and automate the process of producing Wiccap Data Models. Using the tool, the time required to construct a logical data model for a given website is significantly reduced.
Web classification using support vector machine.
In web classification, web pages from one or more web sites are assigned to pre-defined categories according to their content. Since web pages are more than just plain text documents, web classification methods have to consider using other context features of web pages, such as hyperlinks and HTML tags. In this paper, we propose the use of Support Vector Machine (SVM) classifiers to classify web pages using both their text and context feature sets. We have experimented our web classification method on the WebKB data set. Compared with earlier Foil-Pilfs method on the same data set, our method has been shown to perform very well. We have also shown that the use of context features especially hyperlinks can improve the classification performance significantly.
Online and Incremental Mining of Separately%2DGrouped Web Access Logs.

Ontology%2Dbased Web Annotation Framework for HyperLink Structures.

Evaluating Web Access Log Mining Algorithms A Cognitive Approach.

An intelligent middleware for linear correlation discovery.

Product Schema Integration for Electronic Commerce %2D A Synonym Comparison Approach.

Anatomy of the coupling query in a web warehouse.


On Conceptual Micro%2DObject Modeling.

3rd International Workshop on Web Information and Data Management %28WIDM 2001%29

Improving the Fairness of Timely Refresh of Web Views.

Query Integration for Refreshing Web Views.

ViDE A Visual Data Extraction Environment for the Web.

Cooperative Multi%2DAttribute Bilateral Online Negotiation for E%2DCommerce.

Hierarchical Text Classification and Evaluation.
Hierarchical Classification refers to assigning of one or more suitable categories from a hierarchical category space to a document. While previous work in hierarchical classification focused on virtual category trees where documents are assigned only to the leaf categories, we propose a topdown level-based classification method that can classify documents to both leaf and internal categories. As the standard performance measures assume independence between categories, they have not considered the documents incorrectly classified into categories that are similar or not far from the correct ones in the category tree. We therefore propose the Category-Similarity Measures and DistanceBased Measures to consider the degree of misclassification in measuring the classification performance. An experiment has been carried out to measure the performance of our proposed hierarchical classification method. The results showed that our method performs well for Reuters text collection when enough training documents are given and the new measures have indeed considered the contributions of misclassified documents.
Ontologies and Electronic Commerce.


Report on the third International Workshop on Web Information and Data Management %28WIDM%272001%29.

Re%2Dengineering structures from Web documents.
To realise a wide range of applications (including digital libraries) on the Web, a more structured way of accessing the Web is required and such requirement can be facilitated by the use of XML standard. In this paper, we propose a general framework for reverse engineering (or re-engineering) the underlying structures i.e., the DTD from a collection of similarly structured XML documents when they share some common but unknown DTDs. The essential data structures and algorithms for the DTD generation have been developed and experiments on real Web collections have been conducted to demonstrate their feasibility. In addition, we also proposed a method of imposing a constraint on the repetitiveness on the elements in a DTD rule to further simplify the generated DTD without compromising their correctness.
Storage Management of a Historical Web Warehousing System.

Financial Advisor Agent in a Multi%2DAgent Financial Trading System.

Keeping a Very Large Website Up%2Dto%2Ddate Some Feasibility Results.
. As websites grow large and become more sophisticated, organizations  use structured database systems as a source of base data  for information on the website. Thus, it has become critical to keep a  very large website up-to-date in response to the frequent changes in base  data. This gives rise to an important issue: Can a website be timely refreshed  by executing a set of queries against the base data? In this paper,  we investigate the feasibility of scheduling a set of queries to refresh a  very large website. Based on two types (tight and loose) of feasibility  requirements, we present feasibility results when the base data change  with uniform, regular and random periods. We found that tight feasibility  depends on the interval length between two consecutively raised cell  refresh requests while it is NP-Hard to determine loose feasibility when  the base data have regular or random update periods. For the case when  the base data have the uniform update periods, loose feasibilit...
On Warehousing Historical Web Information.

An Integrated Data Mining System to Automate Discovery of Measures of Association.
Many data analysts require tools which can integrate their database management packages (e.g. Microsoft Access) with their data analysis ones (e.g. SAS, SPSS), and provide guidance for the selection of appropriate mining algorithms. In addition, the analysts need to extract and validate statistical results to facilitate data mining. In this paper, we describe an integrated data mining system called the Linear Correlation Discovery System (LCDS) that meets the above requirement. LCDS consists of four major subcomponents, two of which, the selection assistant and the statistics coupler, are discussed in this paper. The former examines the schema and instances to determine appropriate association measurement functions (e.g. chi-square, linear regression, ANOVA). The latter invokes the appropriate statistical function on a sample data set, and extracts relevant statistical output such as η 2, and R 2 for effective mining of data. We also describe a new validation algorithm based on measuring the consistency of mining results applied to multiple test sets.
Detecting and Representing Relevant Web Deltas using Web Join.

Reducing Cognitive Overheads in a Web Warehouse Using Reverse%2DOsmosis.

eBroker An Agent%2DBased Query Routing System for Distributed E%2DCommerce Databases.

DTD%2DMiner A Tool for Mining DTD from XML Documents.
The World-Wide Web (WWW) is one of the richestrepositories of information in the world today. People no longer use the Web simply for browsing but also for nu-merous E-Commerce applications like making airline ticket and hotel reservations, and performing banking transac-tions. Nevertheless, for Web based E-commerce to be successful, one has to overcome the interoperability issues be-tween different E-commerce sites. At present, most of the E-commerce sites present their products and services inWeb documents that are not very well structured.
Model and Research Issues for Refreshing a Very Large Website.
The WWW is a new advertising media in recent years where corporations utilize it to increase their exposure to consumers. Although there has been much work on WWW information management, research in keeping information on websites up-to-date is still in its infancy. For a very large website whose content is derived from some source databases, it is important to maintain its freshness in response to changes to the base data. This issue is particularly significant for websites presenting fast changing information such as stock exchange information and product information. In this paper, we propose a model for studying the problem of refreshing a very large website in time and identify several important research issues in maintaining the currency of information on such websites. We also discuss possible approaches to timely refresh a website under the framework.  1. Introduction  The popularity of the World-Wide Web (WWW) has made it a prime vehicle for disseminating information. More and...
Data Visualization Operators for WHOWEDA.

The integration of relationship instances from heterogeneous databases.

An Overview of the Agent%2DBased Electronic Commerce System %28ABECOS%29 Project.

Heterogeneous product description in electronic commerce.

Cost%2Dbenefit analysis of web bag in a web warehouse An analytical approach.

Advances in Database Technologies
With the increased emphasis on healthcare worldwide, the issue of being able to efficiently and effectively manage large amount of patient information in diverse medium becomes critical. In this work, we will demonstrate how advanced database technologies are used in RETINA, an integrated system for the screening and management of diabetic patients. RETINA captures the profile and retinal images of diabetic patients and automatically processes the retina fundus images to extract interesting features. Given the wealth of information acquired, we employ novel techniques to determine the risk profile of patients for better patient care management and to target significant sub-populations for more detailed studies. The results of such studies can be used to introduce effective preventive measures for the targeted sub-populations. 1.
ZBroker A Query Routing Broker for Z39.50 Databases.
A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user&#039;s information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and their results, and summarizes the bibliographic database content into a knowledge base. We present the design and implementation of ZBroker and describe its Web-based user interface.  KEYWORDS: query routing, bibliographic databases, digital libraries  1. INTRODUCTION  As the number of information sources increases rapidly on the Internet, users are beginn...
Pi%2DWeb Join in a Web Warehouse.

Cluster%2DBased Database Selection Techniques for Routing Bibliographic Queries.
this paper, we focus on the database selection problem in the context of a global digital library consisting of a large number of online bibliographic servers. Each server hosts a bibliographic database that contains bibliographic records each of which consists of text values for a number of pre-defined bibliographic attributes such as title, author, call number, subject, etc.. Each bibliographic database supports user queries on the bibliographic attributes. Since  bibliographic records are relatively small in size, we only consider bibliographic databases that support boolean queries on the bibliographic attributes, and the query results are not ranked. While focusing on bibliographic databases, we believe that our proposed solution can be extended to handle other databases that contain searchable text attributes. Formally, we define a general database selection problem as follows:
On the Feasibility of Website Refresh Queries.

Calling All Agents%2C Where Are You%3F
We believe the next step in the application of agent technology to the Internet is the  massive population of the Internet with software agents functioning in a wide range of  capacities: information filtering, information brokering, commerce, negotiation, and so  on. In such an environment, a means to effectively locate relevant agents for relevant  tasks is indispensable. In this paper, we examine issues in the design and implementation  of a `directory agent&#039; that store meta-information of other agents. In particular, we  present results from our work on building a a scalable directory agent for a large-scale,  distributed agent-based e-commerce system (the Abecos project).  Keywords: Software Agents, Electronic Commerce, Database Systems  1 Introduction  The potential of electronic commerce arises out of the fact that it is a technology that does not improve old processes, but instead allows one to break old rules and create a new paradigm in which business is to be conducted. Howe...
Locating Web Information Using Web Checkpoints.
Conventional search engines locate information by letting users establish a single web checkpoint . By specifying one or more keywords, users direct search engines to return a set of documents that contain those keywords. From the documents (links) returned by search engines, user proceed to further probe the WWW from there. Hence, these initial set of documents (contingent upon the occurrence of keyword(s)) serve as a web checkpoint. Generally, these links are numerous and may not result in much fruitful searches. By establishing multiple web checkpoints, a richer and controllable search procedure can be constructed to obtain more relevant Web information. This paper presents the design and implementation of permitting multiple checkpoints to facilitate improved searching on the WWW. Web checkpointing is performed as part of the  Whoweda project. 1 Introduction  Today, business organizations are turning to information on the WWW to assist in their decision making process instead of re...
WEDAGEN %2D A Synthetic Web Database Generator.

Web Warehousing An Algebra for Web Information.
While conventional keyword indexes maintained by web search engines such as Yahoo, Lycos, and World Wide Web Worm work well for most simple keyword searches, they are inadequate when more complex and structured queries involving the underlying hypertext structure of the World Wide Web are desired. Building from a database perspective, existing work to support such queries focuses on constructing SQL-like query languages for the WWW that assumes a relational abstraction of the WWW. Nonetheless, the WWW is a directed graph and imposing a relational abstraction filters out its inherent topological structure. In this paper, we propose a data model for the WWW that retains its topological structure and construct a web algebra to manipulate objects in this model. The web algebra establishes a formal foundation from which different web query languages can be designed. 1 Introduction  From a user&#039;s perspective, the World Wide Web is a broadcast medium where a wide range of up-to-date informati...
Non%2DRepudiation in an Agent%2DBased Electronic Commerce System.
Abecos is an agent-based e-commerce system under development at the Nanyang Technological  University. It aims to provide a software infrastructure for a large scale, distributed  system whereby seller and buyer (software) agents engage in e-commerce activities  on behalf of organizations and individuals. A key factor in making this system  usable in practice is strict security controls. One aspect of security is the provision of  non-repudiation services. As protocols for non-repudiation have focused on the singlemessage  non-repudiation, its adaptation to afford non-repudiation in a communication  session for two agents in Abecos is inefficient. In this work, we investigate and propose  a protocol for enforcing non-repudiation in a session. We compare and show that it is  more efficient than simple adaptations of existing protocols.  Keywords: Electronic Commerce, Security, Non-Repudiation Protocol  1 Introduction  Electronic commerce is an emerging paradigm of business on the fast g...
Research Issues in Web Data Mining.

Algebraic Operations on Bags in a Web Warehouse.

Cost%2DBenefit Analysis of Web Bag in a Web Warehouse.

Harp A Distributed Query System for Legacy Public Libraries and Structured Databases.

ZBroker A Query Routing Broker for Z39.50 Databases
A query routing broker is a software agent that determines from a large set of accessing information sources the ones most relevant to a user&#039;s information need. As the number of information sources on the Internet increases dramatically, future users will have to rely on query routing brokers to decide a small number of information sources to query without incurring too much query processing overheads. In this paper, we describe a query routing broker known as ZBroker developed for bibliographic database servers that support the Z39.50 protocol. ZBroker samples the content of each bibliographic database by using training queries and their results, and summarizes the bibliographic database content into a knowledge base. We present the design and implementation of ZBroker and describe its Web-based user interface.  KEYWORDS: query routing, bibliographic databases, digital libraries  1. INTRODUCTION  As the number of information sources increases rapidly on the Internet, users are beginn...
Tuple Source Relational Model A Source%2DAware Data Model for Multidatabases.
Abstract—Once the relational data model is extended to support the fuzzy multidatabases, there is need to have a language to facilitate fuzzy queries formulations on integrated fuzzy relations under the extended relational data model. Formulation of such a query needs functions that do not exist in classical data manipulation languages such as SQL, which is designed to manipulate data in a single database. Classical SQL deals with single relation as an object of manipulation where as the current need is to allow sets of relations as the objects. Therefore, there is a need to extend the SQL to FTS-SQL that supports fuzzy query formulation on FTS relations [12] under the extended relational data model. To extend the SQL to FTS-SQL, a query syntax is proposed with additional clause HAVING α, β and WITH SOURCE-CONTEXT (optional). An option [sameDB] or [anyDB] is attached to SELECT and WHERE clauses that give a direction to the query processor for query evaluation. By specifying a suitable value to α, β ∈ [0, 1], a precision fuzzy query can be formulated. Default values for α and β are set to 1 which correspond to crisp case. Thus formulation of crisp queries on FTS relations are also allowed. Use of WITH clause joins the source context information to each of the resultant tuple. To process these fuzzy queries efficiently, a query processing architecture is proposed that has a query mediator and a number of query agents to handle the query processing tasks. A query decomposition and optimization strategy is proposed based on the use of option [sameDB]/[anyDB] attached with WHERE clause and two algorithms namely, FTS-SQL-Processing-1 &amp; FTS-SQL-Processing-2 are devised to support them. The query syntax and the query processing algorithms are explained by means of illustrative examples.
Export database derivation in object%2Doriented wrappers.

Database Selection Techniques for Routing Bibliographic Queries.
Query routing (also known as server ranking and collection fusion in some specific context) refers to the general problem of selecting from a large set of accessible information sources the ones relevant to a given query, and evaluating the query on the selected sources. It consists of three steps, namely database selection, query evaluation, and  result merging. As the number of information sources on the Internet increases dramatically, query routing is becoming increasingly important. Much of the previous work in query routing focused on information sources that are document collections. In this paper, we address the query routing problem for databases with multiple text attributes. In particular, we have proposed a number of different database selection methods each requiring different types of knowledge about the databases&#039; content, e.g. past queries, past query results, and statistical information collected from the database records. By conducting a series of experiments on a set...
Querying Structured Web Resources.
this paper, we do not attempt to address the problem of tagging web pages. We will however focus on the idea of structured web queries and their result representation. STRUCTURED RETRIEVAL QUERIES
Web Warehousing An Algebra for Web Information.
While conventional keyword indexes maintained by web search engines such as Yahoo, Lycos, and World Wide Web Worm work well for most simple keyword searches, they are inadequate when more complex and structured queries involving the underlying hypertext structure of the World Wide Web are desired. Building from a database perspective, existing work to support such queries focuses on constructing SQL-like query languages for the WWW that assumes a relational abstraction of the WWW. Nonetheless, the WWW is a directed graph and imposing a relational abstraction filters out its inherent topological structure. In this paper, we propose a data model for the WWW that retains its topological structure and construct a web algebra to manipulate objects in this model. The web algebra establishes a formal foundation from which different web query languages can be designed. 1 Introduction  From a user&#039;s perspective, the World Wide Web is a broadcast medium where a wide range of up-to-date informati...
Join Processing in Web Databases.
. Recently, there has been increasing interests in data models and query languages for unstructured data in the World Wide Web. When web data is harnessed in a web warehouse, new and useful information can be derived through appropriate information manipulation. In our web warehousing project, we introduce a new operator called the web join. Like its relational counterpart, web join combines information from two web tables to yield a new web table. This paper discusses various issues in web join such as join semantics, joinability, and join evaluation. 1 Introduction  Given the high rate of growth of the volume of data available on the WWW, locating information of interest in such an anarchic setting becomes a more difficult process everyday. Thus, there is the recognition of the undeferring need for effective and efficient tools for information consumers, who must be able to easily locate and manipulate information in the Web. We aim to build a web warehouse containing information ext...
A Global Object Model for Accommodating Instance Heterogeneities.
To completely address database integration problems in the context of multidatabase and data warehousing systems, one has to examine various integration and query requirements. In this paper, we identify three phases of database integration, i.e. analysis, derivation, and evolution. Due to poor data quality in local databases and local database updates, some unresolved instance conflicts have to be accommodated by the integrated databases. We have therefore proposed a new global object model to accommodate instance conflicts and to provide query support on the data containing instance conflicts throughout the derivation and evolution phases of database integration. The new global object model, known as OORA , has been designed to allow database integrators and end users to query both the local and resolved instance values using the same query language. 1 Introduction  To integrate two or more pre-existing databases without violating their local autonomy, either a multidatabase approach...
Information Coupling in Web Databases.
Web information coupling refers to an association of topically related web documents. This coupling is initiated explicitly by a user in a web warehouse specially designed for web information. Web information coupling provides the means to derive additional, useful information from the WWW. In this paper, we discuss and show how two web operators, i.e., global web coupling and local web coupling , are used to associate related web information from the WWW and also from multiple web tables in a web warehouse. This paper discusses various issues in web coupling such as coupling semantics, coupling-compability, and coupling evaluation. 1 Introduction  Given the high rate of growth of the volume of data available on the WWW, locating information of interest in such an anarchic setting becomes a more difficult task everyday. Thus, there is the recognition of the undeferring need for effective and efficient tools for information consumers, who must be able to easily locate and manipulate inf...
A Heuristic Method for Correlating Attribute Group Pairs in Data Mining.

Data Visualization in a Web Warehouse.


Web Warehousing Design and Issues.


Deriving Object Oriented Federated Databases and Processing Federated Queries.

A Relational Interface for Heterogeneous Information Sources.

Distributed Query Processing for Clustered and Bibliographic Databases.

Source%2Daware Multidatabase Query Processing.
We introduce a multidatabase model to represent the information that derives from different local databases. This model, known as Tuple-Source (TS) relational model, accommodates tuples from different local databases by attaching them with their source information in the global relations which are also known as TS-relations. In other words, a source attribute is implicit in every TS-relation. To manipulate the global relations, we have developed the TSSQL query language and implemented a distributed query processor to process such queries. In this paper, we report our distributed query processing architecture and algorithms. Our architecture consists of a query mediator and a number of query agents, one for each local database. By encapsulating the heterogeneous query interfaces to different local databases within the query agents, we allow a generic query processing strategy to be adopted by the query mediator. Our approach further ensures that local autonomy is preserved. 1 Introduct...
Managing World Wide Web publications.

Export Database Derivation and Query Processing for Object%2DOriented Wrappers.
Wrappers export the schema and data of existing heterogeneous databases and support queries on them. In the context of cooperative information systems, we present a flexible approach to specify the derivation of object-oriented export databases from local relational databases. Our export database derivation consists of a set of extent derivation structures which defines the extent and deep extent of export classes. Having well-defined semantics, the extent derivation structures can be readily used in transforming wrapper queries to local queries. Based on the extent derivation structures, we developed a wrapper query evaluation strategy which handles object-oriented queries on the export databases. The strategy further considers the limited query processing capabilities of local database systems and the language constraints on the local query languages.  1 Introduction  Traditionally, a wrapper has been defined to be a software component that converts data and queries from one model to...
On Integrating Existing Bibliographic Databases and Structured Databases.
It is widely accepted that future digital library applications have to be built upon different kinds of database servers to draw from them different forms of data. These data include bibliographic data, text data, multimedia data as well as structured data. In this paper, we address the problem of integrating existing bibliographic and structured databases which reside at different locations in the network. To integrate bibliographic data and structured data, we extended the well-known SQL model to represent bibliographic related attributes and queries. In particular, we have added a new data type to model attributes in the bibliographic database. We have also designed specialized predicates and functions that can be used to formulate queries on bibliographic data alone as well as queries on both bibliographic and structured data. By combining our SQL extensions with the other SQL extensions that model general text data, we believe that a versatile query language layer can be made avai...
LibSearch A Window%2DBased Frontend to Remote Bibliographic Databases on the Internet.
Over the past several years, a number of wide-area information navigation and discovery tools have  been introduced, including WAIS[1], Gopher[2], World-Wide Web[3], etc. In this paper, we describe a  graphical query interface to remote bibliographic databases that can be found on the internet. A library  query client, called LibSearch, has been designed and implemented using a set of APIs based on Z39.50  protocol standard[4]. Z39.50 is an application-layer protocol within the OSI reference model designed  to allow library users to remotely access the bibliographic records in the library systems. As increasing  number of OPAC systems are being established as Z39.50 servers on the internet, Libsearch provides a  user-friendly environment to specify search requests and retrieve bibliographic information from these  servers. LibSearch supports: (1) the use of window icons to enable users to easily carry out their search  activities, (2) remote accesses to diverse library catalogue system...
An Evidential Reasoning Approach to Attribute Value Conflict Resolution in Database Integration.

Entity Identification in Database Integration.
The objective of entity identification is to determine the correspondence between object instances from more than one database. This paper examines the problem at the instance level assuming that schema level heterogeneity has been resolved a priori. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. We propose the use of extended key, which is the union of keys (and possibly other attributes) from the relations to be matched, and its corresponding identity rule, to determine the equivalence between tuples from relations which may not share any common key. Instance level functional dependencies (ILFD), a form of semantic constraint information about the real-world entities, are used to derive the missing extended key attribute values of a tuple. 1 Introduction  Database integration is the problem of taking two (or mor...
An Algebraic Transformation Framework for Multidatabase Queries.

Myriad Design and Implementation of a Federated Database Prototype.
This paper describes our experiences in the design and implementation of Myriad, and in the project management. Special emphasis is given to discussing design alternatives and their impact on Myriad. This paper also presents the software engineering principles and the project management techniques we used in developing Myriad and the lessons we learned. We believe these lessons would be useful for practitioners who wish to develop a similar system
Resolving Attribute Incompatibility in Database Integration An Evidential Reasoning Approach.
Resolving domain incompatibility among independently developed databases often involves uncertain information. DeMichiel [5] showed that uncertain information can be generated by the mapping of conflicting attributes to a common domain, based on some domain knowledge. In this paper, we show that uncertain information can also arise when the database integration process requires information not directly represented in the component databases, but can be obtained through some summary of data. We therefore propose an extended relational model based on DempsterShafer theory of evidence[14] to incorporate such uncertain knowledge about the source databases. We also develop a full set of extended relational operations over the extended relations. In particular, an extended union operation has been formalized to combine two extended relations using Dempster&#039;s rule of combination. The closure and boundedness properties of our proposed extended operations are formulated. 1 Introduction  The inc...
The MYRIAD Federated Database Prototype.

Multiple Query Optimization with Depth%2DFirst Branch%2Dand%2DBound and Dynamic Query Ordering.

Query Optimization and Processing in Federated Database Systems.
this paper, we have selected a minimal set of core operations that includes the set of relational operations, i.e. foe,ß,1,\Gamma,[g, as  well as three other operators which are useful in specifying the federated views. These are 2-way Outerjoin Operator (
Entity Identification in Database Integration.
The objective of entity identification is to determine the correspondence between object instances from more than one database. This paper examines the problem at the instance level assuming that schema level heterogeneity has been resolved a priori. Soundness and completeness are defined as the desired properties of any entity identification technique. To achieve soundness, a set of identity and distinctness rules are established for entities in the integrated world. We propose the use of extended key, which is the union of keys (and possibly other attributes) from the relations to be matched, and its corresponding identity rule, to determine the equivalence between tuples from relations which may not share any common key. Instance level functional dependencies (ILFD), a form of semantic constraint information about the real-world entities, are used to derive the missing extended key attribute values of a tuple. 1 Introduction  Database integration is the problem of taking two (or mor...
Federated Autonomous Databases Project Overview.

Semantic Networks and Associative Databases Two Approaches to Knowledge Representation and Reasoning.

